Computing Exponentials of Real Matrices Diagonalizable Over C

نویسنده

  • Jean Gallier
چکیده

In this note, we consider the problem of computing the exponential of a real matrix. It is shown that if A is a real n × n matrix and A can be diagonalized over C, then there is a formula for computing e involving only real matrices. When A is a skew symmetric matrix, the formula reduces to the generalization of Rodrigues’s formula given in Gallier and Xu [1].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues

In this paper, preliminary research results on a new algorithm for finding all the eigenvalues and eigenvectors of a real diagonalizable matrix with real eigenvalues are presented. The basic mathematical theory behind this approach is reviewed and is followed by a discussion of the numerical considerations of the actual implementation. The numerical algorithm has been tested on thousands of mat...

متن کامل

MAT 544 Real Analysis

3. The Implicit Function Theorem and its special case, the Inverse Function Theorem. Relation to the Contraction Mapping Fixed Point Theorem. Computation of several iterates of the approximating sequence to the implicit function. Continuity and differentiability of the implicit function. Application to differentiable variation of the fixed point in the Contraction Mapping Fixed Point Theorem. 4...

متن کامل

Characterization of Diagonalizable Matrices: An Algorithm

Let T be a linear opeartor and D be a matrix. So by its diagonal matrix, we get a lot of informations about T , namely we can almost answer any question about T . In this paper we introduce an efficient algorithm that characterizes whether a given matrix is diagonalizable in the field F or not (where F is the real field R or the complex field C). Mathematics Subject Classification: 11C08, 65F30...

متن کامل

Computation of the q-th roots of circulant matrices

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

متن کامل

A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices

In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000